Relational Scaling and Databases

نویسنده

  • Joachim Hereth Correia
چکیده

More than 20 years of theoretical development and practical experience in the field of Conceptual Information Systems have made available a wide variety of structure and procedures to gain new knowledge from data or to present it in a user-friendly way, by restructuring the data in a conceptual way to help the user interpret and understand the meaning. Even longer, Database Theory has helped develop highly efficient database systems, processing daily huge amounts of data. However, both theories can profit from a cooperation: on the one hand, data and database modeling methodologies could be applied to the building of Conceptual Information System, the connection between the presented conceptual structures and the original data can be clarified. On the other hand, database theory may profit from the experience and ideas for more user-centered interfaces to the stored data, as well as profit from the translation of theoretical results. In this paper, we present the first necessary steps to perform a translation between the languages used in both domains. For this purpose, we introduce basic notions from Database Theory with a focus on the operations, which are basic for a first application: a more formal way to describe the process of Relational Scaling [PW99] and the transformation of data for Conceptual Information Systems in general. Conversely, we present an approach for a standard problem of database theory by using methods from Formal Concept Analysis. Finally, we discuss the next steps needed for the integration of these two theories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable RDF Views of Relational Databases through Partial Evaluation

The semantic web represents meta-data as a triple relation using the RDF data model. We have developed a system to process queries to RDF views of entire relational databases. Optimization of queries to such views is challenging because i) RDF views of entire relational databases become large unions, and ii) queries to the views are more general than relational database queries, making no clear...

متن کامل

Data Migration: Relational Rdbms to Non-relational Nosql

As a part of achieving specific targets, business decision making involves processing and analyzing large volumes of data that leads to growing enterprise databases day by day. Considering the size and complexity of the databases used in today’s enterprises, it is a major challenge for enterprises to re-engineering their applications that can handle large amounts of data. Compared to traditiona...

متن کامل

Scaling Probabilistic Databases

Probabilistic databases, which have been widely studied over the past years, lie at the expressive intersection of databases and probabilistic graphical models, thus aiming to provide efficient support for the evaluation of probabilistic queries over uncertain, relational data. Several Machine Learning approaches, on the one hand, have recently investigated the issue of distributed probabilisti...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Random Regression for Bayes Nets Applied to Relational Data

Bayes nets (BNs) for relational databases are a major research topic in machine learning and artificial intelligence. When the database exhibits cyclic probabilistic dependencies, the usual Bayes net product formula does not define valid inferences. In this paper we describe and evaluate a new approach to defining Bayes net relational inference in the presence of cyclic dependencies. The key id...

متن کامل

Text Schema Mining Using Graphs and Formal Concept Analysis

A Linearly Complex Model for Knowledge Representation . . . . . . . . . . . . . . . . . .20 Janos Sarbo and József Farkas Relation Graphs: A Structure for Representing Relations in Contextual Logic of Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 Silke Pollandt Information Transfer across Simple Concept Graphs . . . . . . . . . . . . . . . . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002